منابع مشابه
Rational Structure on Algebraic Tangles and Closed Incompressible Surfaces in Algebraically Alternating Knots and Links
Let F be an incompressible, meridionally incompressible and not boundary-parallel surface in the complement of an algebraic tangle (B, T ). Then F separates the strings of T in B and the boundary slope of F is uniquely determined by (B, T ) and hence we can define the slope of the algebraic tangle. In addition to the Conway’s tangle sum, we define a natural product of two tangles. The slopes an...
متن کاملJones Polynomials of Alternating Links
Let Jk(*) = nrtr + • ■ • + asta, r > s, be the Jones polynomial of a knot if in S3. For an alternating knot, it is proved that r — s is bounded by the number of double points in any alternating projection of K. This upper bound is attained by many alternating knots, including 2-bridge knots, and therefore, for these knots, r — s gives the minimum number of double points among all alternating pr...
متن کاملDeterminant density and biperiodic alternating links
Let L be any infinite biperiodic alternating link. We show that for any sequence of finite links that Følner converges almost everywhere to L, their determinant densities converge to the Mahler measure of the 2–variable characteristic polynomial of the toroidal dimer model on an associated biperiodic graph.
متن کاملNullification Writhe and Chirality of Alternating Links
In this paper, we show how to split the writhe of reduced projections of oriented alternating links into two parts, called the nullification writhe wx, and the remaining writhe wy , such that the sum of these quantities equals the writhe w and each quantity remains an invariant of isotopy. The chirality of oriented alternating links can be detected by a non-zero wx or wy, which constitutes an i...
متن کاملA Proximal Alternating Direction Method for Semi-Definite Rank Minimization
Semi-definite rank minimization problems model a wide range of applications in both signal processing and machine learning fields. This class of problem is NP-hard in general. In this paper, we propose a proximal Alternating Direction Method (ADM) for the well-known semi-definite rank regularized minimization problem. Specifically, we first reformulate this NP-hard problem as an equivalent bico...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Duke Mathematical Journal
سال: 2017
ISSN: 0012-7094
DOI: 10.1215/00127094-2017-0004